Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation
نویسندگان
چکیده
Attribute reduction is one of the key issues in rough set theory. Many heuristic attribute reduction algorithms such as positive-region reduction, information entropy reduction and discernibility matrix reduction have been proposed. However, these methods are usually computationally time-consuming for large data. Moreover, a single attribute significance measure is not good for more attributes with the same greatest value. To overcome these shortcomings, we first introduce a counting sort algorithm with time complexity O(jCj jUj) for dealing with redundant and inconsistent data in a decision table and computing positive regions and core attributes (jCj and jUj denote the cardinalities of condition attributes and objects set, respectively). Then, hybrid attribute measures are constructed which reflect the significance of an attribute in positive regions and boundary regions. Finally, hybrid approaches to attribute reduction based on indiscernibility and discernibility relation are proposed with time complexity no more than max(O(jCjjU/Cj),O(jCjjUj)), in which jU/Cj denotes the cardinality of the equivalence classes set U/C. The experimental results show that these proposed hybrid algorithms are effective and feasible for large data. 2010 Elsevier Inc. All rights reserved.
منابع مشابه
Data analysis based on discernibility and indiscernibility
Rough set theory models similarities and differences of objects based on the notions of indiscernibility and discernibility. With respect to any subset of attributes, one can define two pairs of dual relations: the strong indiscernibility and weak discernibility relations, and the weak indiscernibility and strong discernibility relations. The similarities of objects are examined by the indiscer...
متن کاملHybrid Attribute Reduction for Classification Based on A Fuzzy Rough Set Technique
Data usually exists with hybrid formats in real-world applications, and a unified data reduction for hybrid data is desirable. In this paper a unified information measure is proposed to computing discernibility power of a crisp equivalence relation and a fuzzy one, which is the key concept in classical rough set model and fuzzy rough set model. Based on the information measure, a general defini...
متن کاملEntropies Of Fuzzy Indiscernibility Relation And Its Operations
Yager’s entropy was proposed to compute the information of fuzzy indiscernibility relation. In this paper we present a novel interpretation of Yager’s entropy in discernibility power of a relation point of view. Then some basic definitions in Shannon’s information theory are generalized based on Yager’s entropy. We introduce joint entropy, conditional entropy, mutual information and relative en...
متن کاملIncremental update of rough set approximation under the grade indiscernibility relation
The incremental updating of lower and upper approximations under the variation of information systems is an important issue in rough set theory. Many incremental updating approaches with respect to different kinds of indiscernibility relations have been proposed. The grade indiscernibility relation is a fuzzification of classical Pawlak’s indiscernibility relation which can characterize the sim...
متن کاملA Measure Method for Indiscernibility in Imperfect Information System
Traditionally, the information system is assumed to be perfect, i.e. attribute values are not missing and supposed to be precise. In fact, imperfect information system is always existent. In this paper, based on imperfect information system (include missing data and imprecise data), the concepts of indiscernibility and discernibility are defined, their important properties are given, and the re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Int. J. Approx. Reasoning
دوره 52 شماره
صفحات -
تاریخ انتشار 2011